Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics
نویسندگان
چکیده
منابع مشابه
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics
Scheinerman and Wilf [SW94] assert that “an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph Kn.” A rectilinear drawing of Kn is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersec...
متن کاملNew Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn
We provide a new lower bound on the number of (≤ k)-edges of a set of n points in the plane in general position. We show that for 0 ≤ k ≤ bn−2 2 c the number of (≤ k)-edges is at least Ek(S) ≥ 3 ( k + 2 2 ) + k ∑ j=b3 c (3j − n + 3), which, for b3 c ≤ k ≤ 0.4864n, improves the previous best lower bound in [11]. As a main consequence, we obtain a new lower bound on the rectilinear crossing numbe...
متن کاملMore on the crossing number of Kn: Monotone drawings
The Harary-Hill conjecture states that the minimum number of crossings in a drawing of the complete graph Kn is Z(n) := 1 4 ⌊ n 2 ⌋ ⌊ n−1 2 ⌋ ⌊ n−2 2 ⌋ ⌊ n−3 2 ⌋ . This conjecture was recently proved for 2-page book drawings of Kn. As an extension of this technique, we prove the conjecture for monotone drawings of Kn, that is, drawings where all vertices have different x-coordinates and the edg...
متن کاملImproved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of (≤ k)-sets in a set of points in general position. We then use this to show that if S is a set of n points in general position, then the number (S) of convex quadrilaterals determined by the points in S is at least 0.37553 ( n 4 ) +O(n). This in turn implies that the rectilinear crossing number cr(Kn) of the comp...
متن کاملThe maximum number of halving lines and the rectilinear crossing number of Kn for n
For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving pseudolines, determined by n points in the plane. For this range of values of n we also present exact values of the rectilinear cr(n) and the pseudolinear e cr(n) crossing number of the complete graph Kn. eh(n) and e cr(n) are new for n ∈ {14, 16, 18, 20, 22, 23, 24, 25, 26, 27}, h(n) is new for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00491-0